#include <cstdio>
#include <set>
#include <queue>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
struct node
{
	int tis;
	set <int> mot;
}nd;
int t[100000];
queue<node>qe;
int bfs(int n)
{
	nd = qe.front();
}
int main()
{
	
	int n,m;
	while(scanf("%d %d",&n,&m)!=EOF)
	{
		for(int i = 0;i<n;i++)
		{
			scanf("%d",&t[i]);
		}
		for(int i = 1;i<=m;i++)
		{
			nd.mot.insert(i);
		}
		nd.tis = 0;
		qe.push(nd);
		int ans = bfs(n);
	}
}
